Minimal crossing number implies minimal supporting genus

نویسندگان

چکیده

A virtual link may be defined as an equivalence class of diagrams, or alternatively a stable links in thickened surfaces. We prove that minimal crossing diagram has genus across representatives the class. This is achieved by constructing new parity theory for links. As corollaries, we crossing, bridge, and ascending numbers classical do not decrease when it regarded link. extends corresponding results case knots due to Manturov Chernov.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Computation of the Minimal Crossing Number of a Graph

Determining the crossing number of a graph is an important problem with applications in areas such as circuit design and network connguration. In this paper we present the rst parallel algorithm for solving this combinatorial optimization problem. This branch-and-bound algorithm, which adds and deletes crossings in an organized fashion, presents us with the opportunity to verify many conjecture...

متن کامل

The Genus Crossing Number

Pach and Tóth [6] introduced a new version of the crossing number parameter, called the degenerate crossing number, by considering proper drawings of a graph in the plane and counting multiple crossing of edges through the same point as a single crossing when all pairwise crossings of edges at that point are transversal. We propose a related parameter, called the genus crossing number, where ed...

متن کامل

Topological Minimal Genus

We obtain new lower bounds of the minimal genus of a locally flat surface representing a 2-dimensional homology class in a topological 4-manifold with boundary, using the von Neumann-Cheeger-Gromov ρ-invariant. As an application our results are employed to investigate the slice genus of knots. We illustrate examples with arbitrarily large slice genus for which our lower bound is optimal but all...

متن کامل

minimal, vertex minimal and commonality minimal cn-dominating graphs

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

متن کامل

Higher genus Riemann minimal surfaces

Even though the classification of genus zero, embedded minimal surfaces is not complete, W. H. Meeks J. Perez and A. Ros [14], [15], [16] have made progress concerning the question of the uniqueness of the Riemann examples in the class of genus zero embedded minimal surfaces which have an infinite number of ends. They conjecture in [15] that every embedded minimal surface of finite genus and wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of The London Mathematical Society

سال: 2021

ISSN: ['1469-2120', '0024-6093']

DOI: https://doi.org/10.1112/blms.12491